Schur covers and Carlitz’s conjecture

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SCHUR COVERS and CARLITZ’S CONJECTURE

We use the classification of finite simple groups and covering theory in positive characteristic to solve Carlitz’s conjecture (1966). An exceptional polynomial f over a finite field Fq is a polynomial that is a permutation polynomial on infinitely many finite extensions of Fq. Carlitz’s conjecture says f must be of odd degree (if q is odd). Indeed, excluding characteristic 2 and 3, arithmetic ...

متن کامل

A Theorem and a Conjecture on Rectangles and Schur Functions

Fix a rectangular Young diagram R, and consider all the products of Schur functions sλsλc , where λ and λ c run over all (unordered) pairs of partitions which are complementary with respect to R. Theorem: The self-complementary products, s λ where λ = λ, are linearly independent of all other sλsλc . Conjecture: The products sλsλc are all linearly independent.

متن کامل

A conjecture on independent sets and graph covers

In this article, I present a simple conjecture on the number of independent sets on graph covers. The conjecture implies that the partition function of a binary pairwise attractive model is greater than that of the Bethe approximation.

متن کامل

On Consecutive Quadratic Non-residues: a Conjecture of Issai Schur

Issai Schur once asked if it was possible to determine a bound, preferably using elementary methods, such that for all prime numbers p greater than the bound, the greatest possible number of consecutive quadratic non-residues modulo p is always less than p. (One can find a brief discussion of this problem in R. K. Guy’s book [5]). Schur also pointed out that the greatest number of consecutive q...

متن کامل

A Counterexample to Wegner's Conjecture on Good Covers

In 1975 Wegner conjectured that the nerve of every finite good cover in R is d-collapsible. We disprove this conjecture. A good cover is a collection of open sets in R such that the intersection of every subcollection is either empty or homeomorphic to an open d-ball. A simplicial complex is d-collapsible if it can be reduced to an empty complex by repeatedly removing a face of dimension at mos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Israel Journal of Mathematics

سال: 1993

ISSN: 0021-2172,1565-8511

DOI: 10.1007/bf02808112